Set Systems with Restricted Intersections modulo Prime Powers
نویسندگان
چکیده
We study set systems satisfying FrankllWilson-type conditions modulo prime powers. We prove that the size of such set systems is polynomially bounded, in contrast with V. Grolmusz's recent result that for non-prime-power moduli, no polynomial bound exists. More precisely we prove the following result. Theorem. Let p be a prime and q= p k. v For all i, j (1i< jm), there exists l (1ls) such that |A i & A j | #+ l (mod q).
منابع مشابه
Set Systems with Restricted t-wise Intersections Modulo Prime Powers
We give a polynomial upper bound on the size of set systems with restricted t-wise intersections modulo prime powers. Let t ≥ 2. Let p be a prime and q = p be a prime power. Let L = {l1, l2, . . . , ls} be a subset of {0, 1, 2, . . . , q − 1}. If F is a family of subsets of an n element set X such that |F1 ∩ · · · ∩ Ft| (mod q) ∈ L for any collection of t distinct sets from F and |F | (mod q) /...
متن کاملSet-Systems with Restricted Multiple Intersections
We give a generalization for the Deza-Frankl-Singhi Theorem in case of multiple intersections. More exactly, we prove, that if H is a set-system, which satisfies that for some k, the k-wise intersections occupy only ` residue-classes modulo a p prime, while the sizes of the members of H are not in these residue classes, then the size of H is at most (k − 1) ∑̀
متن کاملOn set systems with restricted intersections modulo p and p-ary t-designs
We consider bounds on the size of families F of subsets of a v-set subject to restrictions modulo a prime p on the cardinalities of the pairwise intersections.We improve the known bound when F is allowed to contain sets of different sizes, but only in a special case. We show that if the bound for uniform families F holds with equality, then F is the set of blocks of what we call a p-ary t-desig...
متن کاملOn Set Systems with Restricted Intersections Modulo a Composite Number
Let S be a set of n elements, and let H be a set-system on S, which satisses that the size of any element of H is divisible by m, but the intersection of any two elements of H is not divisible by m. If m is a prime or prime-power, then the famous Frankl{Wilson theorem 3] implies that jHj = O(n m?1), i.e. for xed m, its size is at most polynomial in n. This theorem has numerous applications in c...
متن کاملCompleteness results for metrized rings and lattices
The Boolean ring $B$ of measurable subsets of the unit interval, modulo sets of measure zero, has proper radical ideals (for example, ${0})$ that are closed under the natural metric, but has no prime ideal closed under that metric; hence closed radical ideals are not, in general, intersections of closed prime ideals. Moreover, $B$ is known to be complete in its metric. Togethe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 95 شماره
صفحات -
تاریخ انتشار 2001